A Comparative Study of Rateless Codes for P2P Persistent Storage
نویسندگان
چکیده
This paper evaluates the performance of two seminal rateless erasure codes, LT Codes and Online Codes. Their properties make them appropriate for coping with communication channels having an unbounded loss rate. They are therefore very well suited to peer-to-peer systems. This evaluation targets two goals. First, it compares the performance of both codes in different adversarial environments and in different application contexts. Second, it helps understanding how the parameters driving the behavior of the coding impact its complexity. To the best of our knowledge, this is the first comprehensive study facilitating application designers in setting the optimal values for the coding parameters to best fit their P2P context.
منابع مشابه
An Effective Replication Technique Using Rateless Codes for Unstructured P2P Networks
It is possible to recover the original data from a certain amount of encoded data by using rateless codes, which are utilized for multicast streaming. In this paper, we propose an effective replication technique using rateless codes for unstructured P2P networks. More specifically, we propose a method to spread and find chunks generated from files efficiently. Through simulation experiments, we...
متن کاملReducing content distribution time in P2P-based multicast using rateless codes
In this paper a novel protocol for application level multicast, that is designed so as to exploit the advantages offered by rateless coding, is proposed. With rateless coding a set of k packets can be used to generate an arbitrary number of coded packets. Any set of slightly more than k coded packets can be used by a node in the network to recover the information. The proposed protocol is based...
متن کاملExploiting Rateless Coding in Structured Overlays to Achieve Persistent Storage. (L'Exploitation de Codes Fontaines pour un Stockage Persistant des Données dans les Réseaux d'Overlay Structurés)
The substantial increase in the amount of information over the Internet has contributed to an extraordinary demand for persistent data storage. Centralized storage architectures are expensive, weakly scalable and vulnerable to attacks as they represent single points of failure in the system. Over last few years, peer-to-peer architectures have emerged as an alternative for implementing persiste...
متن کاملStudy of the Decoding Complexity for Rateless Erasure Codes
Over the Internet, bit errors within the data packets translate into packet losses at the higher layers of the OSI model, yielding a packet erasure channel. Modern erasure correcting codes promise to offer a very simple and efficient solution to data transfers over these channels, opening up also other interesting applications. Amongst them one can enumerate reliable large scale content distrib...
متن کاملPrecoded EWF codes for unequal error protection of scalable video
Rateless codes are forward error correcting (FEC) codes of linear encoding-decoding complexity and asymptotically capacity-approaching performance over erasure channels with any erasure statistics. They have been recently recognized as a simple and efficient solution for packetized video transmission over networks with packet erasures. However, to adapt the error correcting capabilities of rate...
متن کامل